منابع مشابه
About Strongly Universal Cellular Automata
In this paper, we construct a strongly universal cellular automaton on the line with 11 states and the standard neighbourhood. We embed this construction into several tilings of the hyperbolic plane and of the hyperbolic 3D space giving rise to strongly universal cellular automata with 10 states.
متن کاملIntrinsically Universal Cellular Automata
This talk advocates intrinsic universality as a notion to identify simple cellular automata with complex computational behavior. After an historical introduction and proper definitions of intrinsic universality, which is discussed with respect to Turing and circuit universality, we discuss construction methods for small intrinsically universal cellular automata before discussing techniques for ...
متن کاملStrongly Mixing Properties of Multidimensional Cellular Automata
This paper investigates the k-mixing property of a multidimensional cellular automaton. Suppose F is a cellular automaton with the local rule f defined on a d-dimensional convex hull C which is generated by an apex set C. Then F is k-mixing with respect to the uniform Bernoulli measure for all positive integer k if f is a permutation at some apex in C. An algorithm called the Mixing Algorithm i...
متن کامل5-State Rotation-Symmetric Number-Conserving Cellular Automata are not Strongly Universal
We study two-dimensional rotation-symmetric numberconserving cellular automata working on the von Neumann neighborhood (RNCA). It is known that such automata with 4 states or less are trivial, so we investigate the possible rules with 5 states. We give a full characterization of these automata and show that they cannot be strongly Turing universal. However, we give example of constructions that...
متن کاملUniversal Cellular Automata in the Hyperbolic Spaces
This paper introduces several cellular automata in hyperbolic spaces which are able to simulate any computational device, as they are universal. We sketchily present five universal cellular automata, four of them on two grids of the hyperbolic plane and one in a grid of the hyperbolic 3D space. Key–Words: Theory of Computation, Cellular Automata, universality, hyperbolic geometry.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Proceedings in Theoretical Computer Science
سال: 2013
ISSN: 2075-2180
DOI: 10.4204/eptcs.128.17